An Algorithm to Compute the Free Distance of Turbo Codes
نویسندگان
چکیده
A new algori thm for computing the free distance of turbo codes is applied to the CCSDS and the UMTS standard codes. Results on the free distance behaviour for increasing interleaver length are also presented.
منابع مشابه
An approach to fault detection and correction in design of systems using of Turbo codes
We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...
متن کاملAn Approach to Increasing Reliability Using Syndrome Extension
Computational errors in numerical data processing may be detected efficiently by using parity values associated with real number codes, even when inherent round off errors are allowed in addition to failure disruptions. This paper examines correcting turbo codes by straightforward application of an algorithm derived for finite-field codes, modified to operate over any field. There are syndromes...
متن کاملTurbo codes with non-uniform constellations
Absrract-This paper presents parallel concatenated turbo codes that employ a non-uniform constellation to achieve shaping gain. The output signal approximates the Gaussian distribution by using equally likely signals with unequal spacing (a non-uniform constellation). The small distance of points near the center of the constellation may lead to a small overall free distance and thus a high erro...
متن کاملImproving the Constituent Codes of Turbo Encoders
The performance of Turbo codes can be improved by choosing the best constituent encoder. Previous lists of the best constituent codes were found based on maximising the input weight two effective free distance d 2. We show that minimis-ing the number of nearest neighbours N 2 is also an important requirement. If there are multiple codes having the same d 2 and N 2 , we show that the minimum dis...
متن کاملRevisiting the calculation of effective free distance of turbo codes
Introduction: Several authors [1, 2] have agreed that the performance of turbo codes [3] at the error floor region is largely determined by the weight-2 input minimum distance, which corresponds to the minimum Hamming weight among all codeword sequences generated by input sequences of weight two. If a turbo code T consists of N parallel concatenated convolutional codes separated by uniform inte...
متن کامل